An extended QR-solver for large profiled matrices
نویسندگان
چکیده
منابع مشابه
A QR-Based Solver for Rank Structured Matrices
In this paper we show how to compute the QR-factorization of a rank structured matrix in an efficient way, using the Givens-weight representation which we introduced in an earlier paper. We also show how the QR-factorization can be used as a preprocessing step for the solution of linear systems. The performance of this scheme will be demonstrated by the results of some numerical experiments.
متن کاملA Parallel Qr-factorization/solver of Quasiseparable Matrices
Abstract. This manuscript focuses on the development of a parallel QR-factorization of structured rank matrices, which can then be used for solving systems of equations. First, we will prove the existence of two types of Givens transformations, named rank decreasing and rank expanding Givens transformations. Combining these two types of Givens transformations leads to different patterns for ann...
متن کاملMining Time-Profiled Associations: An Extended Abstract
A time-profiled association is an association pattern consistent with a query sequence over time, e.g., identifying the interacting relationship of droughts and wild fires in Australia with the El Nino phenomenon in the past 50 years. Traditional association rule mining approaches reveal the generic dependency among variables in association patterns but do not capture the evolution of these pat...
متن کاملAn extended ode solver for sensitivity calculations
A rcccntly published semi-implicit Rung+Kulta algorithm has been extended to compute parameter sensitivities in dynamical systems. The decomposed direct method (DDM) of sensitivity analysis results in a general and compact FORTRAN program, well-suited even for small computers. The straightforward DDM provides more accurate sensitivities than does the numerically efficient, but more involved Gre...
متن کاملStructured QR algorithms for Hamiltonian symmetric matrices
Efficient, backward-stable, doubly structure-preserving algorithms for the Hamiltonian symmetric and skew-symmetric eigenvalue problems are developed. Numerical experiments confirm the theoretical properties of the algorithms. Also developed are doubly structure-preserving Lanczos processes for Hamiltonian symmetric and skew-symmetric matrices.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal for Numerical Methods in Engineering
سال: 2009
ISSN: 0029-5981
DOI: 10.1002/nme.2618